Refinable Function
نویسنده
چکیده
Modularity is the fundamental aspect of modern software engineering, however many advanced modularity techniques requires prospective technologies as part of development and operation process. In this paper, we present Refinable Function, an object-oriented approach to advanced languagebased, symmetric modularity technique for the procedure. We conceptually compare Refinable Function to existing technique to substantiate benefits of modularity can be implemented in on well-established object-oriented language without compiler support. We introduce concepts of inheritance, encapsulation, and polymorphism of function for bringing object-orientation to procedure modularity and describe the design and implementation of Refinable Function in JavaScript to validate our approach to practical web application development. We introduce the practical aspect of Refinable Function implementation by discussing concerns of applying modularity on asynchronous processing. We tested and implemented Refinable Function to substantiate its relevance to web application development and product line implementation. CCS Concepts • Software and its engineering → Abstraction, modeling and modularity; Software development techniques; Language features; Design patterns;
منابع مشابه
On Refinable Sets
A refinable set is a compact set with positive Lebesgue measure whose characteristic function satisfies a refinement equation. Refinable sets are a generalization of self-affine tiles. But unlike the latter, the refinement equations defining refinable sets may have negative coefficients, and a refinable set may not tile. In this paper, we establish some fundamental properties of these sets.
متن کاملStructure of Refinable Splines
A refinable spline is a compactly supported refinable function that is piecewise polynomial. Refinable splines, such as the well known B-splines, play a key role in computer aided geometric designs. Refinable splines have been studied in several papers, most noticably in [7] for integer dilations and [3] for real dilations. There are general characterizations in these papers, but these characte...
متن کاملOrthogonality Criteria for Compactly Supported Refinable Functions and Refinable Function Vectors
A refinable function φ(x) : Rn → R or, more generally, a refinable function vector 8(x) = [φ1(x), . . . , φr (x)]T is an L1 solution of a system of (vector-valued) refinement equations involving expansion by a dilation matrix A, which is an expanding integer matrix. A refinable function vector is called orthogonal if {φj (x − α) : α ∈ Zn, 1 ≤ j ≤ r} form an orthogonal set of functions in L2(Rn)...
متن کاملHow to Refine Polynomial Functions
Refinable functions are functions that are in a sense self-similar: If you add shrunken translates of a refinable function in a weighted way, then you obtain that refinable function again. For instance, see Figure 1 for how a quadratic B-spline can be decomposed into four small B-splines and how the so called Daubechies-2 generator function is decomposed into four small variants of itself. All ...
متن کاملProjectable Multivariate Refinable Functions and Biorthogonal Wavelets
A biorthogonal wavelet is derived from a pair of biorthogonal refinable functions using the standard technique in multiresolution analysis. In this paper, we introduce the concept of projectable refinable functions and demonstrate that many multivariate refinable functions are projectable; that is, they essentially carry the tensor product (separable) structure though themselves may be non-tens...
متن کاملThe Limits of Refinable Functions
A function φ is refinable (φ ∈ S) if it is in the closed span of {φ(2x−k)}. This set S is not closed in L2(R), and we characterize its closure. A necessary and sufficient condition for a function to be refinable is presented without any information on the refinement mask. The Fourier transform of every f ∈ S \ S vanishes on a set of positive measure. As an example, we show that all functions wi...
متن کامل